Fast and Memory Efficient Segmentation of Lung Tumors Using Graph Cuts
نویسندگان
چکیده
In medical imaging, segmenting accurately lung tumors stay a quite challenging task when touching directly with healthy tissues. In this paper, we address the problem of extracting interactively these tumors with graph cuts. The originality of this work consists in (1) reducing input graphs to reduce resource consumption when segmenting large volume data and (2) introducing a novel energy formulation to inhibit the propagation of the object seeds. We detail our strategy to achieve relevant segmentations of lung tumors and compare our results to hand made segmentations provided by an expert. Comprehensive experiments show how our method can get solutions near from ground truth in a fast and memory efficient way.
منابع مشابه
Evaluation of methods of co-segmentation on PET/CT images of lung tumor: simulation study
Introduction: Lung cancer is one of the most common causes of cancer-related deaths worldwide. Nowadays PET/CT plays an essential role in radiotherapy planning specially for lung tumors as it provides anatomical and functional information simultaneously that is effective in accurate tumor delineation. The optimal segmentation method has not been introduced yet, however several ...
متن کاملFast 4D segmentation of large datasets using graph cuts
In this paper, we propose to use 4D graph cuts for the segmentation of large spatio-temporal (4D) datasets. Indeed, as 4D datasets grow in popularity in many clinical areas, so will the demand for efficient general segmentation algorithms. The graph cuts method has become a leading method for complex 2D and 3D image segmentation in many applications. Despite a few attempts in 4D, the use of gra...
متن کاملDiscriminative Random Field Modeling of Lung Tumors in CT Scans
The ability to conduct high-quality automatic 3D segmentation of tumors in CT scans is of high value to busy radiologists. Discriminative random fields (DRFs) were used to segment 3D volumes of lung tumors in CT scan data. Optimal parameters for the DRF inference were first calculated using gradient ascent. These parameters were then used to solve the inference problem using the graph cuts algo...
متن کاملA comparative performance of gray level image thresholding using normalized graph cut based standard S membership function
In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...
متن کاملMulti-shape graph-cuts and its application to lung segmentation from a chest CT volume
This paper presents a novel graph-cuts algorithm that can take into account a multiple-shape constraint and reports a lung segmentation process from a three-dimensional computed tomography (CT) image, based on the graph-cuts algorithm. A major contribution of this paper is the proposal of a segmentation algorithm that can consider multiple shapes in a graph-cuts framework. Using experiments, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010